Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices
نویسندگان
چکیده
The Border algorithm and the iPred algorithm find the Hasse diagrams of FCA lattices. We show that they can be generalized to arbitrary lattices. In the case of iPred, this requires the identification of a join-semilattice homomorphism into a distributive lattice.
منابع مشابه
Computation of Cut Completions and Concept Lattices Using Relational Algebra and RelView
Several relation-algebraic algorithms for computing the cut completion of a partially ordered set are formally developed and afterwards generalized to the case of concept lattices. It is shown how the algorithms can be translated into the programming language of RelView and executed using this system. Furthermore, it is demonstrated how to obtain and draw Hasse diagrams of concept lattices as l...
متن کاملAlgorithms for the Construction of Concept Lattices and Their Diagram Graphs
Several algorithms that generate the set of all formal concepts and graphs of line (Hasse) diagrams of concept lattices are considered. Some modifications of well-known algorithms are proposed. Algorithmic complexity of the algorithms is studied both theoretically (in the worst case) and experimentally. Conditions of preferable use of some algorithms are given in terms of density/sparsity of un...
متن کاملAutomated Lattice Drawing
Lattice diagrams, known as Hasse diagrams, have played an ever increasing role in lattice theory and fields that use lattices as a tool. Initially regarded with suspicion, they now play an important role in both pure lattice theory and in data representation. Now that lattices can be created by software, it is important to have software that can automatically draw them. This paper covers: – The...
متن کاملFolded Hasse diagrams of combined traces
To represent concurrent behaviours one can use concepts originating from language theory, including traces and comtraces. Traces can express notions such as concurrency and causality, whereas comtraces can also capture weak causality and simultaneity. This paper is concerned with the development of efficient data structures and algorithms for manipulating comtraces. We introduce and investigate...
متن کاملAlgorithms for Greechie Diagrams
We give a new algorithm for generating Greechie diagrams with arbitrary chosen number of atoms or blocks (with 2, 3, 4, . . . atoms) and provide a computer program for generating the diagrams. The results show that the previous algorithm does not produce every diagram and that it is at least 105 times slower. We also provide an algorithm and programs for checking Greechie diagram passage by equ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011